Performance Analysis of Iterative Decoding Algorithms for PEG LDPC Codes in Nakagami Fading Channels
نویسنده
چکیده
In this paper we give a comparative analysis of decoding algorithms of Low Density Parity Check (LDPC) codes in a channel with the Nakagami distribution of the fading envelope. We consider the Progressive Edge-Growth (PEG) method and Improved PEG method for the parity check matrix construction, which can be used to avoid short girths, small trapping sets and a high level of error floor. A comparative analysis of several classes of LDPC codes in various propagation conditions and decoded using different decoding algorithms is also presented.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملPerformance Analysis of Protograph LDPC Codes for Nakagami-$m$ Fading Relay Channels
In this paper, we investigate the error performance of the protograph (LDPC) codes over Nakagamim fading relay channels. We first calculate the decoding thresholds of the protograph codes over such channels with different fading depths (i.e., different values of m) by exploiting the modified protograph extrinsic information transfer (PEXIT) algorithm. Furthermore, based on the PEXIT analysis an...
متن کاملCooperative Networks: Bit-Interleaved Coded Modulation with Iterative Decoding
In this paper the performance of bit-interleaved coded modulation-iterative decoding (BICM-ID) based cooperative network is analyzed over Rayleigh, Nakagami-m and Rician fading channels. In this system coding diversity is obtained through BICM and spatial diversity through cooperative relaying network. The analysis is performed for the relays operating in both amplify-and-forward (AF) and decod...
متن کاملSNR Estimation in Nakagami Fading with Diversity for Turbo Decoding
In this paper, we propose an online SNR estimation scheme for Nakagami-m fading channels with equal gain diversity combining. We derive the SNR estimates based on the statistical ratio of certain observables over a block of received data. An online SNR estimator for an AWGN channel has been derived by Summers and Wilson. Recently, we derived an SNR estimation scheme for Nakagami-m fading channe...
متن کامل